On restricted edge-connectivity of graphs
نویسندگان
چکیده
This paper considers the concept of restricted edge-connectivity, and relates that to the edgedegree of a connected graph. The author gives some necessary conditions for a graph whose restricted edge-connectivity is smaller than its minimum edge-degree, then uses these conditions to show some large classes of graphs, such as all connected edge-transitive graphs except a star, and all connected vertex-transitive graphs with odd order or without triangles, have equality of the restricted edge-connectivity and the minimun edge-degree. c © 2002 Elsevier Science B.V. All rights reserved. MSC: 05C40
منابع مشابه
On the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملOn the 3-restricted edge connectivity of permutation graphs
An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G −W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge c...
متن کاملOn restricted edge connectivity of regular Cartesian product graphs
Explicit expressions of the restricted edge connectivity of the Cartesian product of regular graphs are presented; some sufficient conditions for regular Cartesian product graphs to be maximally or super restricted edge connected are obtained as a result.
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 243 شماره
صفحات -
تاریخ انتشار 2002